Low-Rank Tensor Models for Improved Multidimensional MRI: Application to Dynamic Cardiac $T_1$ Mapping
نویسندگان
چکیده
منابع مشابه
Low-Rank Tensor Regularization for Improved Dynamic Quantitative Magnetic Resonance Imaging
In certain medical imaging scenarios, a series of images that vary across organ motion and contrast changes are acquired. In such cases, the reconstruction amounts to recovering ≥ 4-dimensional images. Furthermore, due to the nature of organ motion and contrast changes, such datasets can be well-represented using low-rank tensors. In this work, we investigate the utility of low-rank tensor regu...
متن کاملRank-One and Transformed Sparse Decomposition for Dynamic Cardiac MRI
It is challenging and inspiring for us to achieve high spatiotemporal resolutions in dynamic cardiac magnetic resonance imaging (MRI). In this paper, we introduce two novel models and algorithms to reconstruct dynamic cardiac MRI data from under-sampled k - t space data. In contrast to classical low-rank and sparse model, we use rank-one and transformed sparse model to exploit the correlations ...
متن کاملProvable Models for Robust Low-Rank Tensor Completion
In this paper, we rigorously study tractable models for provably recovering low-rank tensors. Unlike their matrix-based predecessors, current convex approaches for recovering low-rank tensors based on incomplete (tensor completion) and/or grossly corrupted (tensor robust principal analysis) observations still suffer from the lack of theoretical guarantees, although they have been used in variou...
متن کاملLow-rank Tensor Approximation
Approximating a tensor by another of lower rank is in general an ill posed problem. Yet, this kind of approximation is mandatory in the presence of measurement errors or noise. We show how tools recently developed in compressed sensing can be used to solve this problem. More precisely, a minimal angle between the columns of loading matrices allows to restore both existence and uniqueness of the...
متن کاملImproved dynamic MRI reconstruction by exploiting sparsity and rank-deficiency.
In this paper we address the problem of dynamic MRI reconstruction from partially sampled K-space data. Our work is motivated by previous studies in this area that proposed exploiting the spatiotemporal correlation of the dynamic MRI sequence by posing the reconstruction problem as a least squares minimization regularized by sparsity and low-rank penalties. Ideally the sparsity and low-rank pen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computational Imaging
سال: 2020
ISSN: 2333-9403,2334-0118,2573-0436
DOI: 10.1109/tci.2019.2940916